منابع مشابه
Intersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملAutomatic structures for semigroup constructions
We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix semigroups, Bruck-Reilly extensions and wreath products.
متن کاملDirichlet-to-Neumann semigroup acts as a magnifying glass
The first aim of this paper is to illustrate numerically that the Dirichlet-to-Neumann semigroup represented by P. Lax acts as a magnifying glass. In this perspective, we used the finite element method for the discretization of the correspondent boundary dynamical system using the implicit and explicit Euler schemes. We prove by using the Chernoff’s Theorem that the implicit and explicit Euler ...
متن کاملDialogue Acts in Automatic Dialogue Interpreting
In this paper we demonstrate that for an adequate translation of an utterance spoken in a dialogue the dialogue act it performs has to be determined. We introduce an approach that automatically assigns types of dialogue acts to utterances on the basis of both microand macro-structural information. Technically, this assignment is realized by modeling preference rules as weighted defaults in the ...
متن کاملA group-embeddable non-automatic semigroup whose universal group is automatic
The concept of an automatic structure has been generalized from groups [ECH+] to semigroups [CRRT]. Several authors [CRR, Hof, Kam] have asked the following question: Let S be a finitely generated semigroup embeddable in a group and let G be its universal group [CP, Chapter ]. If G is automatic, must S be automatic? Examples in favour of this implication include: free groups and s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2015
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2015.03.032